منابع مشابه
Fast Rendezvous with Advice
Two mobile agents (robots), starting from different nodes of an n-node network at possibly different times, have to meet at the same node. This problem is known as rendezvous. Agents move in synchronous rounds using a deterministic algorithm. In each round, an agent decides to either remain idle or to move to one of the adjacent nodes. Each agent has a distinct integer label from the set {1, . ...
متن کاملRendezvous with constant memory
We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible...
متن کاملPerformance Bounds for Concurrent Software with Rendezvous
Synchronous message-passing communication, or rendezvous, occurring between software tasks can have a signiicant eeect on system performance. The rendezvous style of communication is coming into wider use in programming languages and operating systems for parallel and distributed environments. Understanding the performance implications of this style of inter-task communication is becoming a mat...
متن کاملRendezvous of Agents with Different Speeds
Most cooperative systems are, to some degree, asynchronous. This lack of synchrony is typically considered as an obstacle that makes the achievement of cooperative goals more difficult. In this work, we aim to highlight potential benefits of asynchrony, which is introduced into the system as differences between the speeds of the actions of different entities. We demonstrate the usefulness of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Difference Equations and Applications
سال: 2019
ISSN: 1023-6198,1563-5120
DOI: 10.1080/10236198.2019.1678598